A Hooke-Jeeves Based Memetic Algorithm for Solving Dynamic Optimisation Problems
نویسندگان
چکیده
Dynamic optimisation problems are difficult to solve because they involve variables that change over time. In this paper, we present a new HookeJeeves based Memetic Algorithm (HJMA) for dynamic function optimisation, and use the Moving Peaks (MP) problem as a test bed for experimentation. The results show that HJMA outperforms all previously published approaches on the three standardised benchmark scenarios of the MP problem. Some observations on the behaviour of the algorithm suggest that the original HookeJeeves algorithm is surprisingly similar to the simple local search employed for this task in previous work.
منابع مشابه
Distributed memetic differential evolution with the synergy of Lamarckian and Baldwinian learning
As a population-based optimizer, the differential evolution (DE) algorithm has a very good reputation for its competence in global search and numerical robustness. In view of the fact that each member of the population is evaluated individually, DE can be easily parallelized in a distributed way. This paper proposes a novel distributed memetic differential evolution algorithm which integrates L...
متن کاملA Hybrid Method Combining Genetic Algorithm and Hooke-jeeves Method for Constrained Global Optimization
A new global optimization method combining genetic algorithm and Hooke-Jeeves method to solve a class of constrained optimization problems is studied in this paper. We first introduce the quadratic penalty function method and the exact penalty function method to transform the original constrained optimization problem with general equality and inequality constraints into a sequence of optimizati...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملRandomized Memetic Artificial Bee Colony Algorithm
Artificial Bee Colony (ABC) optimization algorithm is one of the recent population based probabilistic approach developed for global optimization. ABC is simple and has been showed significant improvement over other Nature Inspired Algorithms (NIAs) when tested over some standard benchmark functions and for some complex real world optimization problems. Memetic Algorithms also become one of the...
متن کاملA Hybrid Cross Entropy Algorithm for Solving Dynamic Transit Network Design Problem
This paper proposes a hybrid multiagent learning algorithm for solving the dynamic simulation-based bilevel network design problem. The objective is to determine the optimal frequency of a multimodal transit network, which minimizes total users’ travel cost and operation cost of transit lines. The problem is formulated as a bilevel programming problem with equilibrium constraints describing non...
متن کامل